By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

Recognition of Tree Metrics

Hans-Jürgen Bandelt

pp. 1-6

BibTeX  Abstract Full Text:  PDF

Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments

Amotz Bar-Noy and Joseph Naor

pp. 7-20

BibTeX  Abstract Full Text:  PDF

Parallel Selection with High Probability

Béla Bollobás and Graham Brightwell

pp. 21-31

BibTeX  Abstract Full Text:  PDF

An Isoperimetric Inequality on the Discrete Torus

Béla Bollobás and Imre Leader

pp. 32-37

BibTeX  Abstract Full Text:  PDF

On the Distribution of Lengths of Evolutionary Trees

M. Carter, M. Hendy, D. Penny, L. A. Székely, and N. C. Wormald

pp. 38-47

BibTeX  Abstract Full Text:  PDF

A Fast Perfect-Matching Algorithm in Random Graphs

Olivier Goldschmidt and Dorit S. Hochbaum

pp. 48-57

BibTeX  Abstract Full Text:  PDF

Asymptotically Optimal Linear Algorithm for the Minimum $k$-Cut in a Random Graph

Olivier Goldschmidt and Dorit S. Hochbaum

pp. 58-73

BibTeX  Abstract Full Text:  PDF

Brooks Coloring in Parallel

Péter Hajnal and Endre Szemerédi

pp. 74-80

BibTeX  Abstract Full Text:  PDF

An Almost Linear Time Algorithm for Generalized Matrix Searching

Maria M. Klawe and Daniel J. Kleitman

pp. 81-97

BibTeX  Abstract Full Text:  PDF

The Boolean Basis Problem and How to Cover Some Polygons by Rectangles

Anna Lubiw

pp. 98-115

BibTeX  Abstract Full Text:  PDF

A Theory of Proportional Representation

Jean-Luc Petit and Eric Térouanne

pp. 116-139

BibTeX  Abstract Full Text:  PDF

Bit Serial Multiplication in Finite Fields

Muzhong Wang and Ian F. Blake

pp. 140-148

BibTeX  Abstract Full Text:  PDF

Calcul Saalschützien des Partitions et des Dérangements Colorés

Jiang Zeng

pp. 149-156

BibTeX  Abstract Full Text:  PDF